18f34006a93587f4fe094067c7176344d7c9c7b2,src/graphtea/extensions/reports/hamilton/HamiltonianPathExtension.java,HamiltonianPathExtension,calculate,#GraphModel#,27

Before Change



        HamiltonianCycle hc = new HamiltonianCycle();
        double[][] adj = g.getAdjacencyMatrix().getArray();
        int[][] adjMatrix = new int[g.getVerticesCount()]
                [g.getVerticesCount()];

        for(int i=0;i<g.getVerticesCount();i++) {
            for(int j=0;j<g.getVerticesCount();j++) {
                if(adj[i][j] == 0) adjMatrix[i][j]=0;
                else adjMatrix[i][j]=1;
            }
        }

After Change


        SubGraph sg = new SubGraph();

        HamiltonianCycle hc = new HamiltonianCycle();
        double[][] adj = g.getAdjacencyMatrix().getArray();
        int[][] adjMatrix = Utils.getBinaryPattern(adj,g.getVerticesCount());
        int[] path = hc.HamiltonCycle(adjMatrix);

        if(path == null) return sg;